منابع مشابه
SOS Rule Formats for Idempotent Terms and Idempotent Unary Operators
A unary operator f is idempotent if the equation f(x) = f(f(x)) holds. On the other end, an element a of an algebra is said to be an idempotent for a binary operator if a = a a. This paper presents a rule format for Structural Operational Semantics that guarantees that a unary operator be idempotent modulo bisimilarity. The proposed rule format relies on a companion one ensuring that certain te...
متن کاملIdempotent and co-idempotent stack filters and min-max operators
Viewing the elements of R as images f with pixels i∈ S of grey-scale value f(i) motivates the study of certain nonlinear operators :R → R . For translation invariant (called stack #lters in the signal processing literature) we derive the #rst necessary and su1cient condition for idempotency which can be tested in polynomial time. Various related properties can be tested in polynomial time as we...
متن کاملIntroduction to Asymptotically Idempotent Aggregation Operators
This paper deals with aggregation operators. A new class of aggregation operators, called asymptotically idempotent, is introduced. A generalization of the basic notion of aggregation operator is provided, with an in-depth discussion of the notion of idempotency. Some general contruction methods of commutative, asymptotically idempotent aggregation operators admitting a neutral element are illu...
متن کاملOn the Riesz Idempotent for a Class of Operators
Let A be a bounded linear operator acting on infinite dimensional separable Hilbert space H. Browder’s theorem and a-Browder’s theorem are related to an important property which has a leading role on local spectral theory: the single valued extension property see the recent monograph by Laursen and Neumann [19]. The study of operators satisfying Browder’s theorem is of significant interest, and...
متن کاملIdempotent permutations
Together with a characteristic function, idempotent permutations uniquely determine idempotent maps, as well as their linearly ordered arrangement simultaneously. Furthermore, in-place linear time transformations are possible between them. Hence, they may be important for succinct data structures, information storing, sorting and searching. In this study, their combinatorial interpretation is g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1967
ISSN: 0022-247X
DOI: 10.1016/0022-247x(67)90188-6